Perfect Numbers in ACL2
نویسندگان
چکیده
A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 6= 1 + 2 + 3 + 4 + 6 is not perfect. An ACL2 theory of perfect numbers is developed and used to prove, in ACL2(r), this bit of mathematical folklore: Even if there are infinitely many perfect numbers, the series below, of the reciprocals of all perfect numbers, converges.
منابع مشابه
Continuity and Differentiability in ACL2
This case study shows how ACL2 can be used to reason about the real and complex numbers, using non-standard analysis. It describes some modifications to ACL2 that include the irrational real and complex numbers in ACL2’s numeric system. It then shows how the modified ACL2 can prove classic theorems of analysis, such as the intermediate-value and mean-value theorems.
متن کاملAn Interpreter for Quantum Circuits
This paper describes an ACL2 interpreter for “netlists” describing quantum circuits. Several quantum gates are implemented, including the Hadamard gate H, which rotates vectors by 45◦, necessitating the use of irrational numbers, at least at the logical level. Quantum measurement presents an especially difficult challenge, because it requires precise comparisons of irrational numbers and the us...
متن کاملMechanically Verifying Real-valued Algorithms in Acl2
ACL2 is a theorem prover over a total, rst-order, mostly quantiier-free logic, supporting deened and constrained functions, equality and congruence rewriting, induction, and other reasoning techniques. Based on the Boyer-Moore theorem prover, ACL2 manages to retain much of the avor of its predecessor, while providing a large number of enhancements, one of which is the direct support of rational...
متن کاملExtending ACL2 with SMT Solvers
We present our extension of ACL2 with Satisfiability Modulo Theories (SMT) solvers using ACL2’s trusted clause processor mechanism. We are particularly interested in the verification of physical systems including Analog and Mixed-Signal (AMS) designs. ACL2 offers strong induction abilities for reasoning about sequences and SMT complements deduction methods like ACL2 with fast nonlinear arithmet...
متن کاملVerifying Sierpinski and Riesel Numbers in ACL2
Sierpiński and Riesel numbers are not easy to find. To disqualify an odd positive integer as a Sierpiński number or a Riesel number, one need only locate a prime in the appropriate infinite list. With four exceptions, k = 47,103,143,197, all of the first 100 odd positive integers, 1 ≤ k ≤ 199, are disqualified as Sierpiński numbers by finding at least one prime in the first eight elements of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015